On the Quality of Point Set Triangulations based on Convex Hulls

نویسندگان

  • Peter Jenke
  • Anders Hast
  • Stefan Seipel
چکیده

In this paper we describe a method for directly generating triangle strips from unstructured point clouds based on onion peeling triangulation (OPT). It is an iterative reconstruction of the convex hulls of point clouds in the 2D plane, and it uses pairs of subsequent layers to establish triangle strips. We compare the obtained triangulations with the results of Delaunay triangulations in terms of the distribution of the symmetry of obtained triangles and in regard to the number of polygons/vertices emitted. Our initial results show that onion peeling is a straightforward method to directly obtain large triangle strips of point clouds. As expected, the triangulation is not as well behaved as in Delaunay-triangulation [VK07]. In terms of triangle complexity and average strip length OPT is a very favorable triangulation alternative which also lends suitable for the triangulation of 3D point clouds.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular triangulations of dynamic sets of points

The Delaunay triangulations of a set of points are a class of triangulations which play an important role in a variety of different disciplines of science. Regular triangulations are a generalization of Delaunay triangulations that maintain both their relationship with convex hulls and with Voronoi diagrams. In regular triangulations, a real value, its weight, is assigned to each point. In this...

متن کامل

16 Subdivisions and Triangulations of Polytopes

Our treatment is very combinatorial. In particular, instead of regarding a subdivision as a set of polytopes we regard it as a set of subsets of V , whose convex hulls subdivide P . This may appear to be an unnecessary complication at first, but it has advantages in the long run. It also relates this chapter to Chapter 6 (oriented matroids). For more application-oriented treatments of triangula...

متن کامل

The geometry of circles: Voronoi diagrams, Möbius transformations, Convex Hulls, Fortune’s algorithm, the cut locus and parametrization of shapes

The geometry of circles in the plane is inextricably tied with the group of Möbius transformations, which take circles to circles. This geometry can be seen in a more symmetric after transforming the plane to the sphere, by stereographic projection. Interpretations will be discussed for Voronoi diagrams, Delaunay triangulations,etc. from this point of view. Fortune’s algorithm for constructing ...

متن کامل

An Improved Lower Bound on the Number of Triangulations

Upper and lower bounds for the number of geometric graphs of specific types on a given set of points in the plane have been intensively studied in recent years. For most classes of geometric graphs it is now known that point sets in convex position minimize their number. However, it is still unclear which point sets minimize the number of geometric triangulations; the so-called double circles a...

متن کامل

An Improved Lower Bound on the Minimum Number of Triangulations

Upper and lower bounds for the number of geometric graphs of specific types on a given set of points in the plane have been intensively studied in recent years. For most classes of geometric graphs it is now known that point sets in convex position minimize their number. However, it is still unclear which point sets minimize the number of geometric triangulations; the so-called double circles a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010